When a Matrix and Its Inverse Are Nonnegative
نویسندگان
چکیده
منابع مشابه
Inverse spread limit of a nonnegative matrix
For a given nonnegative n × n matrix A consider the following quantity s(A) := mini,j(A)ij maxi,j(A)ij , m = 1, 2, . . . as long as the denominator is positive. It is simply the ratio between the smallest and the largest entries of Am. We call s(Am) the inverse spread of Am which is interpreted as a measure of the maximum variation among the entries of Am in the multiplicative and reciprocal se...
متن کاملAnalysis on a Nonnegative Matrix Factorization and Its Applications
Abstract. In this work we perform some mathematical analysis on a special nonnegative matrix trifactorization (NMF) and apply this NMF to some imaging and inverse problems. We will propose a sparse low-rank approximation of positive data and images in terms of tensor products of positive vectors and investigate its effectiveness in terms of the number of tensor products to be used in the approx...
متن کاملMaximal nonnegative perturbation of a nonnegative matrix
is known to be stable if and only if ρ(A) < 1. Models of real world dynamical phenomena often involve positive quantities. A dynamical system (1) is called positive if any trajectory of the system starting in the positive orthant R+ remains in R+. In this case, the matrix A has only real positive entries. In many cases, it may be useful to consider systems with a known “nominal” part A and a un...
متن کاملNonnegative Inverse Eigenvalue Problem
Nonnegative matrices have long been a sorce of interesting and challenging mathematical problems. They are real matrices with all their entries being nonnegative and arise in a num‐ ber of important application areas: communications systems, biological systems, economics, ecology, computer sciences, machine learning, and many other engineering systems. Inverse eigenvalue problems constitute an ...
متن کاملNonnegative Matrix Factorization of a Correlation Matrix
We present a dedicated algorithm for the nonnegative factorization of a correlation matrix from an application in financial engineering. We look for a low-rank approximation. The origin of the problem is discussed in some detail. Next to the description of the algorithm, we prove, by means of a counter example, that an exact nonnegative decomposition of a general positive semidefinite matrix is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 2014
ISSN: 0899-6180
DOI: 10.35834/mjms/1404997113